Computational experiments with heuristics for two nature reserve site selection problems

نویسندگان

  • Rex K. Kincaid
  • Catherine Easterling
  • Meagan Jeske
چکیده

Nature reserve site selection has become critical as the human population grows and environmentalists seek ways to preserve species and their natural habitats. Simple tabu searches are developed and tested for two reserve site selection models—the maximal covering species problem and the maximal expected covering problem. The testbed is an Oregon terrestrial vertebrate data set composed of 426 species and 441 hexagonal sites. In addition, an extension to a linearized version of the maximal expected covering problem is proposed and tested. 2006 Elsevier Ltd. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

Design of reserve networks and the persistence of biodiversity.

Sophisticated computational methods have been developed to help us to identify sets of nature reserves that maximize the representation of regional diversity, but, until recently, the methods have not dealt explicitly and directly with the main goal of reserve networks, that of the long-term maintenance of biodiversity. Furthermore, the successful application of current methods requires reliabl...

متن کامل

Optimal Selection of a Connected Reserve Network

Spatial considerations are important in conservation reserve design. A particularly important spatial requirement is the connectivity of selected sites. Direct connections between reserve sites increase the likelihood of species persistence by allowing dispersal and colonization of other areas within the network without species having to leave the reserve. The conventional set-covering and maxi...

متن کامل

Accounting for habitat loss rates in sequential reserve selection: Simple methods for large problems

We develop reserve selection methods for maximizing either species retention in the landscape or species representation in reserve areas. These methods are developed in the context of sequential reserve selection, where site acquisition is done over a number of years, yearly budgets are limited and habitat loss may cause some sites to become unavailable during the planning period. The main meth...

متن کامل

Effective heuristics and meta-heuristics for the quadratic assignment problem with tuned parameters and analytical comparisons

Quadratic assignment problem (QAP) is a well-known problem in the facility location and layout. It belongs to the NP-complete class. There are many heuristic and meta-heuristic methods, which are presented for QAP in the literature. In this paper, we applied 2-opt, greedy 2-opt, 3-opt, greedy 3-opt, and VNZ as heuristic methods and tabu search (TS), simulated annealing, and pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & OR

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2008